Polar codes are a class of channel capacity achieving codes that has beenselected for the next generation of wireless communication standards.Successive-cancellation (SC) is the first proposed decoding algorithm,suffering from mediocre error-correction performance at moderate code length.In order to improve the error-correction performance of SC, two approaches areavailable: (i) SC-List decoding which keeps a list of candidates by running anumber of SC decoders in parallel, thus increasing the implementationcomplexity, and (ii) SC-Flip decoding that relies on a single SC module, andkeeps the computational complexity close to SC. In this work, we propose thepartitioned SC-Flip (PSCF) decoding algorithm, which outperforms SC-Flip interms of error-correction performance and average computational complexity,leading to higher throughput and reduced energy consumption per codeword. Wealso introduce a partitioning scheme that best suits our PSCF decoder.Simulation results show that at equivalent frame error rate, PSCF has up to$4.1 \times$ less computational complexity than the SC-Flip decoder. Atequivalent average number of iterations, the error-correction performance ofPSCF outperforms SC-Flip by up to $0.26$ dB at frame error rate of $10^{-3}$.
展开▼
